Infinitesimal rigidity for non-Euclidean bar-joint frameworks
نویسندگان
چکیده
منابع مشابه
Infinitesimal Rigidity of Symmetric Bar-Joint Frameworks
We propose new symmetry-adapted rigidity matrices to analyze the infinitesimal rigidity of arbitrary-dimensional bar-joint frameworks with Abelian point group symmetries. These matrices define new symmetry-adapted rigidity matroids on grouplabeled quotient graphs. Using these new tools, we establish combinatorial characterizations of infinitesimally rigid two-dimensional bar-joint frameworks wh...
متن کاملOn the Infinitesimal Rigidity of Bar-and-Slider Frameworks
A bar-slider framework is a bar-joint framework a part of whose joints are constrained by using line-sliders. Such joints are allowed to move only along the sliders. Streinu and Theran proposed a combinatorial characterization of the infinitesimal rigidity of generic bar-slider frameworks in two dimensional space. In this paper we propose a generalization of their result. In particular, we prov...
متن کاملThe Almost Periodic Rigidity of Crystallographic Bar-Joint Frameworks
A crystallographic bar-joint framework, C in R, is shown to be almost periodically infinitesimally rigid if and only if it is strictly periodically infinitesimally rigid and the rigid unit mode (RUM) spectrum, Ω(C), is a singleton. Moreover, the almost periodic infinitesimal flexes of C are characterised in terms of a matrix-valued function, ΦC(z), on the d-torus, T, determined by a full rank t...
متن کاملGeneric global rigidity of body-bar frameworks
A basic geometric question is to determine when a given framework G(p) is globally rigid in Euclidean space Rd, where G is a finite graph and p is a configuration of points corresponding to the vertices of G. G(p) is globally rigid in Rd if for any other configuration q for G such that the edge lengths of G(q) are the same as the corresponding edge lengths of G(p), then p is congruent to q. A f...
متن کاملA necessary condition for generic rigidity of bar-and-joint frameworks in d-space
A graph G = (V,E) is d-sparse if each subset X ⊆ V with |X| ≥ d induces at most d|X| − ( d+1 2 ) edges in G. Laman showed in 1970 that a necessary and sufficient condition for a realisation of G as a generic bar-and-joint framework in R to be rigid is that G should have a 2sparse subgraph with 2|V | − 3 edges. Although Laman’s theorem does not hold when d ≥ 3, Cheng and Sitharam recently showed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the London Mathematical Society
سال: 2014
ISSN: 0024-6093
DOI: 10.1112/blms/bdu017